Shuffling with ordered cards
نویسندگان
چکیده
We consider a problem of shuffling a deck of cards with ordered labels. Namely we split the deck of N = kq cards (where t ≥ 1 is maximal) into k equally sized stacks and then take the top card off of each stack and sort them by the order of their labels and add them to the shuffled stack. We show how to find stacks of cards invariant and periodic under the shuffling. We also show when gcd(q, k) = 1 the possible periods of this shuffling are divisors of orderk(N − q).
منابع مشابه
Binar Shuffle Algorithm: Shuffling Bit by Bit
Frequently, randomly organized data is needed to avoid an anomalous operation of other algorithms and computational processes. An analogy is that a deck of cards is ordered within the pack, but before a game of poker or solitaire the deck is shuffled to create a random permutation. Shuffling is used to assure that an aggregate of data elements for a sequence S is randomly arranged, but avoids a...
متن کاملAnalysis of Top-swap Shuffling for Genome Rearrangements
We study Markov chains which model genome rearrangements. These models are useful for studying the equilibrium distribution of chromosomal lengths, and are used in methods for estimating genomic distances. The primary Markov chain studied in this paper is the top-swap Markov chain. The top-swap chain is a card-shuffling process with n cards divided over k decks, where the cards are ordered with...
متن کاملMixing times of the Biased Card Shuffling and the Asymmetric Exclusion Process
Consider the following method of card shuffling. Start with a deck of N cards numbered 1 through N . Fix a parameter p between 0 and 1. In this model a “shuffle” consists of uniformly selecting a pair of adjacent cards and then flipping a coin that is heads with probability p. If the coin comes up heads, then we arrange the two cards so that the lower-numbered card comes before the higher-numbe...
متن کاملMixing times of the biased card shuffling and the asymmetric exclusion process Itai Benjamini
Consider the following method of card shuffling. Start with a deck of N cards numbered 1 through N. Fix a parameter p between 0 and 1. In this model a " shuffle " consists of uniformly selecting a pair of adjacent cards and then flipping a coin that is heads with probability p. If the coin comes up heads then we arrange the two cards so that the lower numbered card comes before the higher numbe...
متن کاملMathematical Developments from the Analysis of Riffle Shuffling
1. Introduction The most common method of mixing cards is the ordinary riffle shuffle, in which a deck of n cards (often n = 52) is cut into two parts and the parts are riffled together. A sharp mathematical analysis for a natural model of riffle shuffling was carried out by Bayer and Diaconis (1992). This gives closed form expressions for the chance of any permutation and allows analytic appro...
متن کامل